#include<bits/stdc++.h>
using namespace std;

int const N = 100009;

int n,ans,znums;
int a[N],attack[N];

int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);

    scanf("%d",&n);
    for(int i = 1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    memset(attack,0,sizeof(attack));
    znums = 0;


    sort(a+1,a+1+n);

    for(int i = 1;i<=n;i++){
        for(int j = i+1;j<=n;j++){
            if(a[j]>a[i] && attack[j] == 0){
                a[i] = 0;
                attack[j] = 1;
                break;
            }
        }
    }


    for(int i = 1;i<=n;i++){
        if(a[i] == 0){
            znums++;
        }
    }

    ans = n-znums;
    printf("%d",ans);

    return 0;
}



